Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity
نویسندگان
چکیده
منابع مشابه
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
We establish an inclusion relation between two uniform models of random k-graphs (for constant k ≥ 2) on n labeled vertices: G(k)(n,m), the random k-graph with m edges, and R(k)(n, d), the random d-regular k-graph. We show that if n log n m nk we can choose d = d(n) ∼ km/n and couple G(k)(n,m) and R(k)(n, d) so that the latter contains the former with probability tending to one as n → ∞. This e...
متن کاملHypergraph Packing And Graph Embedding
We provide suucient conditions for packing two hypergraphs. The emphasis is on the asymptotic case when one of the hypergraphs has a bounded degree and the other is dense. As an application, we give an alternative proof for the bipartite case of the recently developed Blow-up Lemma 12].
متن کاملThe Random Hypergraph Assignment Problem
Parisi’s famous (proven) conjecture states that the expected cost of an optimal assignment in a complete bipartite graph on n + n nodes with i. i. d. exponential edge costs with mean 1 is ∑n i=1 1/i , which converges to an asymptotic limit of π/6 as n tends to infinity. We consider a generalization of this question to complete “partitioned” bipartite hypergraphs G2,n that contain edges of size ...
متن کاملRandom Walks in Hypergraph
Random walks on graphs have been extensively used for a variety of graph-based problems such as ranking vertices, predicting links, recommendations, and clustering. However, many complex problems mandate a high-order graph representation to accurately capture the relationship structure inherent in them. Hypergraphs are particularly useful for such models due to the density of information stored...
متن کاملRandom Hypergraph Irregularity
A hypergraph is k-irregular if there is no set of k vertices all of which have the same degree. We asymptotically determine the probability that a random uniform hypergraph is k-irregular.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2017
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2016.09.003